class Solution {
public:
    int maxArea(vector<int>& height) {
		int left=0,right=height.size()-1;
		int sum=0;
		while(left<right)
		{
			int v=min(height[left],height[right])*(right-left);
			sum=max(sum,v);
			if(height[left]<height[right])
			{
				left++;
			}
			else
			{
				right--;
			}
			
		}
		return sum;
    }
};
